Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus

نویسنده

  • Igor Walukiewicz
چکیده

Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NOTE ON THE COMPLETENESS OF KOZEN’S AXIOMATISATION OF THE PROPOSITIONAL ì-CALCULUS

The propositional ì-calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete. §

متن کامل

A Complete Deductive System for the μ-Calculus

The propositional μ-calculus as introduced by Kozen in [12] is considered. In that paper a finitary axiomatisation of the logic was presented but its completeness remained an open question. Here a different finitary axiomatisation of the logic is proposed and proved to be complete. The two axiomatisations are compared.

متن کامل

A Hilbert-Style Axiomatisation for Equational Hybrid Logic

This paper introduces an axiomatisation for equational hybrid logic based on previous axiomatizations and natural deduction systems for propositional and firstorder hybrid logic. Its soundness and completeness is discussed. This work is part of a broader research project on the development a general proof calculus for hybrid logics.

متن کامل

A Polyadic Modal -calculus a Polyadic Modal -calculus

The propositional-calculus of Kozen extends modal logic with xed points to achieve a powerful logic for expressing temporal properties of systems modelled by labelled transition systems. We further extend Kozen's logic with polyadic modalities to allow for expressing also quite naturally behavioural relations like bisimula-tion equivalence and simulation preorders. We show that the problem of m...

متن کامل

A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus

We present a complete axiomatisation of the operator of projection onto state in the Duration Calculus (DC ) relative to validity in DC without extending constructs. Projection onto state was introduced and studied extensively in our earlier works. We first establish the completeness of a system of axioms and proof rules for the operator relative to validity in the extension of DC by neighbourh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 157  شماره 

صفحات  -

تاریخ انتشار 1995